Intersection Bounds, Robust Bayes, and Updating Ambiguous Beliefs

نویسنده

  • Toru Kitagawa
چکیده

This paper develops multiple-prior Bayesian inference for a set-identi…ed parameter whose identi…ed set is constructed by an intersection of two identi…ed sets. We formulate an econometrician’s practice of "adding an assumption" as "updating ambiguous beliefs." Among several ways to update ambiguous beliefs proposed in the literature, we consider the DempsterShafer updating rule (Dempster (1968) and Shafer (1976)) and the full Bayesian updating rule (Fagin and Halpern (1991) and Ja¤ray (1992)), and argue that the Dempster-Shafer updating rule rather than the full Bayesian updating rule better matches with an econometrician’s common adoption of the analogy principle (Manski (1988)) in the context of intersection bound analysis. Keywords: Intersection Bounds, Multiple Priors, Bayesian Robustness, Dempster-Shafer Theory, Updating Ambiguity, Imprecise Probability, Gamma-minimax, Random Set, JEL Classi…cation: C12, C15, C21. Email: [email protected]. Financial support from the ESRC through the ESRC Center for Microdata Methods and Practice (CEMMAP) (grant number RES-589-28-0001) is gratefully acknowledged.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Ex-Ante Non-Optimality of the Dempster-Schafer Updating Rule for Ambiguous Beliefs (A Commentary on "Updating Ambiguous Beliefs' by Gilboa and Schmeidler)

The most widely used updating rule for non-additive probabilities is the Dempster-Schafer rule. Schmeidler and Gilboa have developed a model of decision making under uncertainty based on non-additive probabilities, and in their paper "Updating Ambiguous Beliefs" they justify the Dempster-Schafer rule based on a maximum likelihood procedure. This note shows in the context of Schmeidler-Gilboa pr...

متن کامل

Cesaltina Pacheco Pires a Rule for Updating Ambiguous Beliefs

When preferences are such that there is no unique additive prior, the issue of which updating rule to use is of extreme importance. This paper presents an axiomatization of the rule which requires updating of all the priors by Bayes rule. The decision maker has conditional preferences over acts. It is assumed that preferences over acts conditional on eventE happening, do not depend on lotteries...

متن کامل

Reverend Bayes on Inference Engines: A Distributed Hierarchical Approach

This paper presents generalizations of Bayes likelihood-ratio updating rule which facilitate an asynchronous propagation of the impacts of new beliefs and/or new evidence in hierarchically organized inference structures with multi-hypotheses variables. The computational scheme proposed specifies a set of belief parameters, communication messages and updating rules which guarantee that the diffu...

متن کامل

Bayes, E-Bayes and Robust Bayes Premium Estimation and Prediction under the Squared Log Error Loss Function

In risk analysis based on Bayesian framework, premium calculation requires specification of a prior distribution for the risk parameter in the heterogeneous portfolio. When the prior knowledge is vague, the E-Bayesian and robust Bayesian analysis can be used to handle the uncertainty in specifying the prior distribution by considering a class of priors instead of a single prior. In th...

متن کامل

Some lower bounds for the $L$-intersection number of graphs

‎For a set of non-negative integers~$L$‎, ‎the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots‎, ‎l}$ to vertices $v$‎, ‎such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$‎. ‎The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011